Unreliable sensor grids: coverage, connectivity and diameter
نویسندگان
چکیده
منابع مشابه
Unreliable Sensor Grids: Coverage, Connectivity and Diameter
We consider an unreliable wireless sensor gridnetwork with n nodes placed in a square of unit area. We are interested in the coverage of the region and the connectivity of the network. We first show that the necessary and sufficient conditions for the random grid network to cover the unit square region as well as ensure that the active nodes are connected are of the form p(n)r(n) ∼ log(n) n , w...
متن کاملCorrection to “Unreliable Sensor Grids: Coverage, Connectivity and Diameter”
As pointed by S. Kumar et. al. in [1], the necessary conditions described in (2) and (3) in [2] are incorrect. A correct necessary condition was in fact given by us in (7) in the proof of Proposition 2.1 in [2]. In this note, we discuss the implications of this necessary condition on the rest of the results in [2]. First, we restate Proposition 2.1 of [2] with the appropriate corrections. Propo...
متن کاملProbability of Coverage and Connectivity in Large-Scale Unreliable Sensor Network
We consider the coverage and connectivity problem of a sensor network with n unreliable nodes, uniformity arranged over a square region of unit area. We propose a novel triangle-arranged circle division method to obtain the the formula of the relationship of probability of coverage and connectivity, sensing radius, transmission radius, failure probability and the numbers of the nodes using prob...
متن کاملCoverage and Connectivity Problem in Sensor Networks
In over deployed sensor networks, one approach to Conserve energy is to keep only a small subset of sensors active at Any instant. For the coverage problems, the monitoring area in a set of points that require sensing, called demand points, and consider that the node coverage area is a circle of range R, where R is the sensing range, If the Distance between a demand point and a sensor node is l...
متن کاملConstructing dependable certainty grids from unreliable sensor data
Measurements from sensors as they are used for robotic grid map applications typically show behavior like degradation or discalibration over time, which affects the quality of the generated maps. This paper presents two novel algorithms for the generation of certainty grids dealing with this behavior. The first algorithm named Fault-Tolerant Certainty Grid (FTCG) performs voting over multiple s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ad Hoc Networks
سال: 2005
ISSN: 1570-8705
DOI: 10.1016/j.adhoc.2004.02.001